Branch-and-bound for bi-objective integer programming
نویسندگان
چکیده
In Pareto bi-objective integer optimization the optimal result corresponds to a set of nondominated solutions. We propose a generic bi-objective branch-and-bound algorithm that uses a problem-independent branching rule exploiting available integer solutions, and cutting plane generation taking advantage of integer objective values. The developed algorithm is applied to the bi-objective team orienteering problem with time windows, considering two minimization objectives. Lower bound sets are computed by means of column generation, while initial upper bound sets are generated by means of multi-directional local search. Comparison to using the same ingredients in an -constraint scheme shows the effectiveness of the proposed branch-andbound algorithm.
منابع مشابه
A Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers
The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...
متن کاملGoal Programming Approach to the Bi-Objective Competitive Flow-Capturing Location-Allocation Problem
Majority of models in location literature are based on assumptions such as point demand, absence of competitors, as well as monopoly in location, products, and services. However in real-world applications, these assumptions are not well-matched with reality. In this study, a new mixed integer nonlinear programming model based on weighted goal programming approach is proposed to maximize the c...
متن کاملA mixed integer bi-level DEA model for bank branch performance evaluation by Stackelberg approach
One of the most complicated decision making problems for managers is the evaluation of bank performance, which involves various criteria. There are many studies about bank efficiency evaluation by network DEA in the literature review. These studies do not focus on multi-level network. Wu (Eur J Oper Res 207:856–864, 2010) proposed a bi-level structure for cost efficiency at the first time. In t...
متن کاملColumn Generation for Bi-Objective Vehicle Routing Problems with a Min-Max Objective
Column generation has been very useful in solving single objective vehicle routing problems (VRPs). Its role in a branch-and-price algorithm is to compute a lower bound which is then used in a branch-and-bound framework to guide the search for integer solutions. In spite of the success of the method, only a few papers treat its application to multi-objective problems and this paper seeks to con...
متن کاملBi-objective Scheduling in Printed Circuit Board Assembly
This paper presents an approach to solve the problem of scheduling printed circuit board assemblies on single production line to minimize total weighted tardiness and total feeder setups, which are sequence dependent. Preemptive integer goal programming model is constructed to represent the bi-objective problem. Although an optimal branch-and-bound method is available, its computational require...
متن کامل